Accurate determination of interference in pin joints Pin-to-plate interference in experimental models of interference-fit joints is significantly overestimated by direct physical measurements, but it can be accurately determined by a simple photoelastic method

Suitable pin-to-hole interference can significantly increase the fatigue life of a pin joint. In practical design, the initial stresses due to interference are high and they are proportional to the effective interference. In experimental studies on such joints, difficulties have been experienced in estimating the interference accurately from physical measurements of pin and hole diameters. A simple photoelastic method has been developed to determine the effective interference to a high degree of accuracy. This paper presents the method and reports illustrative data from a successful application thereof.

Verifying scalings for bending rigidity of bilayer membranes using mesoscale models

The bending rigidity kappa of bilayer membranes was studied with coarse grained soft repulsive potentials using dissipative particle dynamics (DPD) simulations. Using a modified Andersen barostat to maintain the bilayers in a tensionless state, the bending rigidity was obtained from a Fourier analysis of the height fluctuations. From simulations carried out over a wide range of membrane thickness, the continuum scaling relation kappa proportional to d(2) was captured for both the L-alpha and L-beta phases. For membranes with 4 to 6 tail beads, the bending rigidity in the L-beta phase was found to be 10-15 times higher than that observed for the L-alpha phase. From the quadratic scalings obtained, a six fold increase in the area stretch modulus, k(A) was observed across the transition. The magnitude of increase in both kappa and k(A) from the L-alpha to the L-beta phase is consistent with current experimental observations in lipid bilayers and to our knowledge provides for the first time a direct evaluation of the mechanical properties in the L-beta phase.

Performance Evaluation of Distance-Hop Proportionality on Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes on a region in Euclidean space, e.g., the unit square. After deployment, the nodes self-organise into a mesh topology. In a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this paper, we analyse the performance of this approximation. We show that nodes with a certain hop distance from a fixed anchor node lie within a certain annulus with probability approach- ing unity as the number of nodes n → ∞. We take a uniform, i.i.d. deployment of n nodes on a unit square, and consider the geometric graph on these nodes with radius r(n) = c q ln n n . We show that, for a given hop distance h of a node from a fixed anchor on the unit square,the Euclidean distance lies within [(1−ǫ)(h−1)r(n), hr(n)],for ǫ > 0, with probability approaching unity as n → ∞.This result shows that it is more likely to expect a node, with hop distance h from the anchor, to lie within this an- nulus centred at the anchor location, and of width roughly r(n), rather than close to a circle whose radius is exactly proportional to h. We show that if the radius r of the ge- ometric graph is fixed, the convergence of the probability is exponentially fast. Similar results hold for a randomised lattice deployment. We provide simulation results that il- lustrate the theory, and serve to show how large n needs to be for the asymptotics to be useful.

Theory and Algorithms for Hop-Count-Based Localization with Random Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes in a region of Euclidean space. Following deployment, the nodes self-organize into a mesh topology with a key aspect being self-localization. Having obtained a mesh topology in a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this work, we analyze this approximation through two complementary analyses. We assume that the mesh topology is a random geometric graph on the nodes; and that some nodes are designated as anchors with known locations. First, we obtain high probability bounds on the Euclidean distances of all nodes that are h hops away from a fixed anchor node. In the second analysis, we provide a heuristic argument that leads to a direct approximation for the density function of the Euclidean distance between two nodes that are separated by a hop distance h. This approximation is shown, through simulation, to very closely match the true density function. Localization algorithms that draw upon the preceding analyses are then proposed and shown to perform better than some of the well-known algorithms present in the literature. Belief-propagation-based message-passing is then used to further enhance the performance of the proposed localization algorithms. To our knowledge, this is the first usage of message-passing for hop-count-based self-localization.